A simple characterization of the minimal obstruction sets for three-state perfect phylogenies
نویسندگان
چکیده
منابع مشابه
A simple characterization of the minimal obstruction sets for three-state perfect phylogenies
Lam, Gusfield, and Sridhar (2009) showed that a set of three-state characters has a perfect phylogeny if and only if every subset of three characters has a perfect phylogeny. They also gave a complete characterization of the sets of three three-state characters that do not have a perfect phylogeny. However, it is not clear from their characterization how to find a subset of three characters tha...
متن کاملMaintenance Cost Analysis for Replacement Model with Perfect Minimal Repair
With the evolution of technology, the maintenance of sophisticated systems is of concern for system engineers and system designers. The maintenance cost of the system depends in general on the replacement and repair policies. The system replacement may be in a strictly periodic fashion or on a random basis depending upon the maintenance policy. At failure, the repair of the system may be perfor...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
A simple characterization of sets satisfying the Central Sets Theorem
Central subsets of a discrete semigroup S have very strong combinatorial properties which are a consequence of the Central Sets Theorem. Call a set a C-set if it satisfies the conclusion of the Central Sets Theorem. We obtain here a reasonably simple characterization of C-sets in an arbitrary discrete semigroup.
متن کاملFast and Scalable Minimal Perfect Hashing for Massive Key Sets
Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical limitations on the number of input elements they can process, due to high construction time, RAM or external memory usage. We revisit a simple algorithm and show that it is highly competitive with the state of the art,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2012
ISSN: 0893-9659
DOI: 10.1016/j.aml.2012.02.060